Community detection with dependent connectivity
نویسندگان
چکیده
In network analysis, within-community members are more likely to be connected than between-community members, which is reflected in that the edges within a community intercorrelated. However, existing probabilistic models for detection such as stochastic block model (SBM) not designed capture dependence among edges. this paper, we propose new approach incorporate intra-community of connectivities through Bahadur representation. The proposed method does require specifying likelihood function, could intractable correlated binary connectivities. addition, allows heterogeneity between different communities. theory, show incorporating correlation information can achieve faster convergence rate compared independent SBM, and algorithm has lower estimation bias accelerated variational EM. Our simulation studies outperforms multinetwork methods assuming conditional independence We also demonstrate application agricultural product trading networks from countries brain fMRI imaging networks.
منابع مشابه
Community-Detection Cellular Automata with Local and Long-Range Connectivity
We explore a community-detection cellular automata algorithm inspired by human heuristics, based on information diffusion and a non-linear processing phase with a dynamics inspired by human heuristics. The main point of the methods is that of furnishing different “views” of the clustering levels from an individual point of view. We apply the method to networks with local connectivity and long-r...
متن کاملCommunity Detection Using Time-Dependent Personalized PageRank
Local graph diffusions have proven to be valuable tools for solving various graph clustering problems. As such, there has been much interest recently in efficient local algorithms for computing them. We present an efficient local algorithm for approximating a graph diffusion that generalizes both the celebrated personalized PageRank and its recent competitor/companion the heat kernel. Our algor...
متن کاملHeterogeneous network with distance dependent connectivity
We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the basic model is sharply peaked around its mean value. Since the model was originally developed to mimic the social network of acquaintances, to broaden the degree...
متن کاملCommunity Detection with Prior Knowledge
The problem of community detection is a challenging one because of the presence of hubs and noisy links, which tend to create highly imbalanced graph clusters. Often, these resulting clusters are not very intuitive and difficult to interpret. With the growing availability of network information, there is a significant amount of prior knowledge available about the communities in social, communic...
متن کاملCommunity Epidemic Detection with Syzygy
An epidemic is malicious code running on a subset of a community, a homogeneous set of instances of an application. Syzygy is an epidemic detection framework that looks for time-correlated anomalies, i.e., divergence from a model of dynamic behavior. We show mathematically and experimentally that, by leveraging the statistical properties of a large community, Syzygy is able to detect epidemics ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Statistics
سال: 2021
ISSN: ['0090-5364', '2168-8966']
DOI: https://doi.org/10.1214/20-aos2042